Named graphs

نویسندگان

  • Jeremy J. Carroll
  • Christian Bizer
  • Patrick J. Hayes
  • Patrick Stickler
چکیده

The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such named graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas. Named graphs are given an abstract syntax, a formal semantics, an XML syntax, and a syntax based on N3. SPARQL is a query language applicable to named graphs. A specific application area discussed in detail is that of describing provenance information. This paper provides a formally defined framework suited to being a foundation for the Semantic Web trust layer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reciprocal Degree Distance of Grassmann Graphs

Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u  d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.

متن کامل

On Explicit Provenance Management in RDF/S Graphs

The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. In this paper, we argue that named graphs alone cannot capture provenance information in the presence of RDFS reasoning and updates. In order to address this problem, we introduce the notion of RDF/S Graphsets: a graphset is associated with a set of RDF named graphs an...

متن کامل

Semantic Web Publishing using Named Graphs

The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas. In this paper, we explore the application area of Semantic Web publishing: Named Graphs allow publishers to communicate assertional intent, and t...

متن کامل

Position paper: Named Graphs in Linked Data

Named graphs are likely to be at the forefront of any future revisions of the RDF data model. The ability to assert metadata about a graph is essential to provenance tracking, access control, and overall data management in the Semantic Web domain. If named graphs were to be incorporated into RDF, it follows that Linked Data would support named graphs at a basic level. This paper investigates po...

متن کامل

Named Graphs as a Mechanism for Reasoning About Provenance

Named Graphs is a simple, compatible extension to the RDF abstract syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF reification, or knowledge-base specific extensions including quads and contexts. In this paper we demonstrate the use of Named Graphs and our experiences developing new kinds of semantic web application that b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Web Sem.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2005